Semi-independent Partitioning: A Method for Bounding the Solution to COP's
نویسنده
چکیده
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict generalization of the mini buckets algorithm [1]. We demonstrate empirically that another specialization of SIP, called greedy SIP, generally produces a better answer than mini buckets in much less time.
منابع مشابه
Semi-Independent Partitioning: A Method for Approximating the Solution to Constraint Optimization Problems
In this paper we introduce a new method for approximating the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict generalization of the mini buckets algorithm [3] which allows a richer and more effective set of approximation strategies. We demonstrate with theoretical analysis and empirical results that it generally produces a b...
متن کاملPhysical Optics Calculation of Electromagnetic Scattering From Haack Series Nose Cone
In this paper, the physical optics method is used to study the problem of electromagnetic scattering from Haack series nose cone. First, a meshing scheme is introduced which approximates the curvature of the surface by piecewise linear functions in both axial and rotational directions. This results in planar quadrilateral patches and enables efficient determination of the illuminated region and...
متن کاملHaplotype Block Partitioning and tagSNP Selection under the Perfect Phylogeny Model
Single Nucleotide Polymorphisms (SNPs) are the most usual form of polymorphism in human genome.Analyses of genetic variations have revealed that individual genomes share common SNP-haplotypes. Theparticular pattern of these common variations forms a block-like structure on human genome. In this work,we develop a new method based on the Perfect Phylogeny Model to identify haplo...
متن کاملBarycentric Bounds in Stochastic Programming: Theory and Application
The design and analysis of efficient approximation schemes is of fundamental importance in stochastic programming research. Bounding approximations are particularly popular for providing strict error bounds that can be made small by using partitioning techniques. In this article we develop a powerful bounding method for linear multistage stochastic programs with a generalized nonconvex dependen...
متن کاملA New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003